Assertion level proof planning with compiled strategies

نویسنده

  • Dominik Dietrich
چکیده

The objective of this thesis is to ease the formalization of proofs by being able to verify as well as to automatically construct abstract human-style proofs. This is achieved by lifting the logical basis to the abstract assertion level, which has been identified as a style of reasoning that can be found in textbooks. A case study shows that automatic reasoning procedures benefit from the abstract assertion level reasoning. In addition, a strategy language is developed that allows the specification of abstract underspecified declarative proof patterns within the proof document and supports their refinement. Case studies show that complex reasoning patterns can concisely be specified within the developed language. Together, the complementary methods provide a framework to automate declarative proofs at the assertion level.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MEGA From Proof Planning towards Mathematical Knowledge Management

Higher Order Natural Deduction Proof Object Maintenance of proof developments at different layers of granularity which are connected to each other September 25th, 2003 – p.7 Source: Autexier, Benzmüller Proof Data Structure MEGA Main References [CheikhrouhouSorge-ACIDCA-00] Overview on PDS [SiekmannEtAl-35yAutomath] Working with PDS Discussion + Support for proof development at different levels...

متن کامل

Adaptive Assertion - Level Proofs ( Extended Abstract ) ∗

For nearly two decades human-oriented theorem proving techniques have been in the focus of interest of the ΩMEGA project [1] at Saarland University. And since one decade their application to tutorial natural language dialog on mathematical proofs has been studied in the interdisciplinary project DIALOG [3]. The focus on user-orientedness and mathematical practice in these projects resulted in d...

متن کامل

Representing Proof-Planning in the ρ-Calculus

Introduction. Proof planning is a theorem proving technique in which proofs are not conceived immediately by using the low-level calculus rules but at a higher level of abstraction that highlights the main ideas and the outline of a proof and de-emphasizes minor logical or mathematical manipulations on formulae. Hence, proof planning considerably differs from traditional proof search strategies...

متن کامل

Assertion Application in Theorem Proving and Proof Planning

Our work addresses assertion retrieval and application in theorem proving systems or proof planning systems for classical first-order logic. We propose a distributed mediator M between a mathematical knowledge base KB and a theorem proving system TP which is independent of the particular proof and knowledge representation formats of TP and KB and which applies generalized resolution in order to...

متن کامل

Investigation of the Efficacy of Damp-Proof Montmorillonite Nanoclay for Radon Reduction Strategies in Radon Prone Areas of Ramsar

Background: Ramsar, a northern city in Iran, lies on the coast of the Caspian Sea. This city has areas with some of the highest levels of natural radiation measured to date. The radon concentration in some areas of Ramsar is up to 3700 Bq m–3. On the other hand, due to high level of humidity, damp-proof barriers should be used in construction of new buildings in radon prone areas of this cit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012